Description

This PR optimizes SortedStreamSetObjectsList by replacing LinkedList with ArrayList and implementing binary search for insertion, removal, and contains operations.

Related Issue

Fixes #3137

Problem

The current implementation uses LinkedList with linear O(n) scans for insertion and removal operations, leading to poor performance as metadata size grows. The code contained explicit TODO comments requesting binary search optimization.

Solution

• Replaced LinkedList with ArrayList for O(1) random access
• Implemented binary search using Collections.binarySearch()
• Added helper methods findInsertionIndex() and findExactMatch()
• Properly handle duplicate orderId cases (since compareTo uses orderId while equals uses objectId)

Changes Made

File Modified: metadata/src/main/java/org/apache/kafka/metadata/stream/SortedStreamSetObjectsList.java

Key Changes:

1. Data Structure: LinkedList → ArrayList
2. Add Operation: Implemented binary search for insertion
3. Remove Operation: Optimized with binary search (implemented TODO)
4. Contains Operation: Optimized with binary search
5. Added Helper Methods:
   • findInsertionIndex(): Uses Collections.binarySearch() to find insertion point
   • findExactMatch(): Handles duplicate orderId values correctly

Performance Impact

Special Handling

The implementation correctly handles the case where:

• compareTo() uses orderId for sorting
• equals() uses objectId for identity

When multiple objects have the same orderId, the binary search locates one of them, then scans forward and backward to find the exact match by objectId.

Testing

✅ All existing tests pass (SortedStreamSetObjectsListTest.testSorted())
✅ No changes to test files required - behavior is preserved
✅ Verified with: ./gradlew test --tests SortedStreamSetObjectsListTest

Checklist

• Code compiles without errors
• All existing tests pass
• Behavior-preserving change
• Implements existing TODO comments
• Added null safety checks
• Added proper JavaDoc documentation
• Follows project coding standards
• No breaking changes

Additional Notes

This is a behavior-preserving optimization that directly implements the TODO comments present in the original code:

// TODO: optimize by binary search  (in add method)
// TODO: optimize by binary search  (in remove method)

The implementation uses Java's standard Collections.binarySearch() for reliability and maintainability.